Turbo decoder using parallel processing

ABSTRACT

A method of decoding using a log posterior probability ratio L(u k ), which is a function of forward variable α (.) and backward variable β (.). The method comprises dividing the forward variable α (.) and the backward variable β (.) into, for example, two segments p and q, where p plus q equal the length of the code word U. The forward segments α (.) are parallel calculated, and the backward segments β (.) are parallel calculated. The ratio L(u k ) is calculated using the parallel calculated segments of α (.) and β (.).

BACKGROUND AND SUMMARY OF THE INVENTION

The present invention relates generally to decoders and, more specifically, to a turbo decoder that reduces processing time for the computation of A Posteroiri Probability (APP) and is suitable for implementation in parallel processing architectures.

Data delivered over a telecommunication channel are subject to channel noise, channel fading, and interferences from other channels. As a result, data received at the destination are usually “altered” by the channel from those delivered at the source. To ensure error-free transmission, the data are encoded before transmission by a channel encoder to allow the data receiver to detect or correct the errors. For example, if bit 0 is encoded as 000 and bit 1 is encoded as 111, then when one bit error occurs, 000 may become 100, and 111 may becomes 101. The receiver can correct 100 as 000 (bit 0) and 101 as 111 (bit 1) by the “majority rule” or the hamming distance. The part of receiver responsible for correcting errors is called a channel decoder.

Turbo encoders and decoders are used in emerging high-speed telecommunications transmission systems, such as terrestrial digital TV communication systems, and third generation wireless (e.g., WCDMA) communication systems. A turbo decoder has been demonstrated to approach the error correcting limit on both AWGN and Rayleigh fading channels.

Despite the error-correcting efficiency, however, a turbo decoder is computing intensive. To meet the real-time performance (e.g., a few millisecond), it is usually implemented in ASIC. If a turbo decoder is to be implemented in software running on a DSP or a CPU, as in the context of software defined radio, its real-time performance will be improved.

A 3GPP turbo encoder (FIG. 1) consists of a parallel concatenation of two identical RSC (Recursive Systematic Convolutional) encoders separated by an interleaver. The info word U of length K is encoded by the first RSC encoder, and the interleaved info word is encoded by the second RSC encoder. The interleaver de-correlates the inputs to the two RSC's by reordering the input bits to the second RSC, so that it is unlikely that the encoded bits from both RSC's have low weight code words at the same time. Also, it helps the encoded bits to cope with bursty noise. In 3GPP turbo encoder, a pseudo-random block interleaver is used. Both RSC encoded words are terminated by a trellis termination. The turbo encoded words are consists of systematic bits and two parity bits (U, Xp1, Xp2).

As shown in FIG. 2, the standard turbo decoder consists of two concatenated SISO (Soft Input Soft Output) blocks, one for each set of systematic and parity bits, (U′,Xp1′) and (U′,Xp2′), where Xp1′ and Xp2′ denote the noisy version of Xp1 and Xp2, respectively, and the same for U′ (U refers to the info words). The SISO blocks are A Posteriori Probability (APP) decoders also know as Maximum A Posteriori (MAP) decoders. The two SISO blocks are separated by the same interleaver (as the encoder) and its inverse block, the deinterleaver. Upon reception of bits from channel and priori information, each SISO block computes log posterior ratios of each bit with well-known forward and backward algorithm. Once SISO computes the log posterior ratios of all bits, it separates a probabilistic entity that was calculated based on its input from overall posterior, then pass it to the other SISO block. This probabilistic entity is often called extrinsic information (L12 and L21 in FIG. 2) for the other SISO block to use as prior information. The two SISO blocks run in an iterative scheme, mutually exchanging extrinsic information. After the required number of iterations is completed, hard decision is made based on accumulated soft information up to the iteration.

The log posterior probability ratio can be written as:

$\begin{matrix} {{{L\left( u_{k} \right)} = {{\log\left( \frac{P\left( {u_{k} = \left. {+ 1} \middle| y \right.} \right)}{P\left( {u_{k} = \left. {- 1} \middle| y \right.} \right)} \right)} = {\log\left( \frac{\sum\limits_{S^{+}}{{P\left( {S_{k - 1},S_{k},y} \right)}/{P(y)}}}{\sum\limits_{S^{-}}{{P\left( {S_{k - 1},S_{k},y} \right)}/{P(y)}}} \right)}}},} & (1) \end{matrix}$ where S⁺ and S⁻ denote the set of all possible state transitions caused by data input u_(k)=+1 and u_(k)=−1, respectively, and y denotes the set of observations, y=(y₁, . . . , y_(k)) where y_(k)=(u_(k)′, x_(k)′), k=1, . . . , K. Note that yε(U′,Xp1′,Xp2′).

As usual, the posterior probability can be obtained by way of computing weighted likelihood, where weights are provided by the prior probability of the event u_(k). Direct evaluation of weighted likelihood requires the summations over a very large number of state patterns, which is proportional to the sequence length K. Because of the combinatorial complexity, it is not computationally feasible even for a reasonable length of the sequence.

To reduce the computation, an efficient procedure, known as forward and backward algorithm, is often used. In this algorithm, the posterior probability P(u_(k)|y) is factorized into following 3 terms:

-   -   Forward variable, α_(k)(.),     -   Backward variable, β_(k)(.),     -   State transition probability, γ_(k)(.,.).

The α_(k)(.) is the joint probability of the observations y₁, . . . , y_(k) and the state at time k, that is α_(k)(S)=P(S_(k), y₁, . . . , y_(k)). The β_(k)(.) represents the conditional probability of future observations given state at time k, β_(k)(S)=P(y₁, . . . , y_(K+1)|S_(k)). The γ_(k)(.,.) is the probability of the state transitions from k−1 to k, caused by u_(k), and expressed as γ_(k)(S′, S)=P(S_(k)=S, y_(k)|S_(k−1)=S′).

The procedure of recursive calculation of α_(k)(S) is implemented according to

${\alpha_{k}(S)} = {\sum\limits_{S^{*}}{{\alpha_{k - 1}\left( s^{\prime} \right)}{{\gamma_{k}\left( {S^{\prime},S} \right)}.}}}$

For β_(k)(S), the calculation is proceeded recursively as:

${\beta_{k}(S)} = {\sum\limits_{S^{*}}{{\beta_{k + 1}\left( S^{\prime} \right)}{{\gamma_{k + 1}\left( {S,S^{\prime}} \right)}.}}}$

Since the turbo encoder is expected to start and end in state 1, the initial conditions for α_(k)(.) and β_(k)(.) are known and given as α₀(S)=δ_({S,1}) and β_(K)(S)=δ_({S,1}), respectively, where δ_({,.}) denote the Kronecker delta.

Calculation of the posterior entity L(u_(k)) as a function f(α_(k)(.), β_(k)(.)) is then equivalent to:

$\begin{matrix} {{P\left( u_{k} \middle| y \right)} = \frac{\sum\limits_{S^{*}}{{\alpha_{k - 1}\left( s^{\prime} \right)}{\gamma_{k}\left( {S^{\prime},S} \right)}{\beta_{k}(S)}}}{P(y)}} & (2) \end{matrix}$ where S* is the set of state pairs corresponding to all state transitions caused by u_(k)=+1/−1, and P(y) is a normalization constant.

The procedure of forward and backward algorithm is summarized as:

-   -   Calculate γ_(k)(.,.), k=1,2, . . . , K;     -   Calculate α_(k)(.,.) forward recursively, k=1,2, . . . , K;     -   Calculate β_(k)(.,.) backward recursively, k=K−1, . . . 0;     -   Calculate (2) to form (1).

The present invention is a method of decoding using a log posterior probability ratio L(u_(k)), which is a function of forward variable α (.) and backward variable β (.). The method comprises dividing the forward variable α (.) and the backward variable β (.) into, for example, two segments p and q, where p plus q equal the length of the codeword U. The forward segments α (.) are parallel calculated, and the backward segments β (.) are parallel calculated. The ratio L(u_(k)) is calculated using the parallel calculated segments of α (.) and β (.). The first forward segment is calculated from α₁(.), . . . , α_(p)(.) starting from α₀(.), whereas the second forward segment is calculated from α_(p+1)(.), . . . , α_(K)(.) starting from an estimated α_(p)(.). The first backward segment is calculated from β_(K−1)(.), . . . , β_(q+1)(.) starting from β_(K)(.), and the second backward segment is calculated from β_(q)(.), . . . , β₁(.) starting from an estimated β_(q+1)(.).

To obtain the estimated initial point α (.), the forward variable is calculated recursively from p−d+1 where d is an arbitrary amount of time and the state at time p−d+1 is treated as a uniform random variable. Similarly, for β_(q+1)(.), the backward variable is calculated from q+d and again the state at time q+d is treated as a uniform random variable. With treating the states at time p−d+1 and q+d as uniform random variables, no informative prior knowledge of the states at the time is claimed.

The arbitrary amount of time, d, is in the range of 1 to 20 or may be in the range of 15 to 20. Also, the starting points for the estimated probability may also be a predetermined state. This predetermined state may be one divided by the number of possible states.

The method may include dividing the forward variable α (.) and the backward variable β (.) into more than two segments, and each of the forward and reverse segments would be calculated in parallel.

The process is performed in a signal receiver including a decoder.

These and other aspects of the present invention will become apparent from the following detailed description of the invention, when considered in conjunction with accompanying drawings.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram of a 3GPP turbo decoder of the prior art.

FIG. 2 is a block diagram of a 3GPP turbo decoder of the prior art.

FIG. 3 is a graph of bit error rate (BER) for a turbo decoder of the prior art and for a turbo decoder of the present invention under various signal to noise ratios (SNRs).

FIG. 4 is a graph of block error rate or packet error rate (BLER) of the prior art turbo decoder and a turbo decoder according to the present invention under various SNR.

FIG. 5 is a blocked diagram of a Soft Input Soft Output block according to the present disclosure.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

One problem with the standard turbo decoding algorithm is that if the size of input sequence K is large, the time required for the computation of the above forward and backward variables grows, causing a long latency as we go through the forward and backward algorithms. K may reach 5114 bits. To reduce the time in calculating α_(k)(.) and β_(k)(.), the input data is divided into M segments and simultaneously calculate the α_(k)(.) and β_(k)(.) for the M segments. Truncation loss may occur with this segment-based approach; however, simulation results show that the loss was negligible when M=2.

In theory, this parallel scheme reduced the computation to nearly 1 out of M of the original calculation of α_(k)(.) and β_(k)(.) (e.g. ½ for M=2). The parallel computing is for the calculation of α_(k)(.) and β_(k)(.), which are the most computational intensive part of a turbo decoder.

The parallel algorithm will be discussed for the case of M=2 as an example. For M>2, the algorithm is similar. The algorithm consists of the following steps:

1. Divide the forward and the backward variable into two parallel segments of size p and q, respectively, where p+q=K.

2. Calculate the four segments simultaneously with the following four processes as shown in FIG. 5:

-   -   Process 1: calculate α₁(.), . . . , α_(p)(.) starting from         α₀(.);     -   Process 2: calculate α_(p+1)(.), . . . , α_(K)(.) starting from         an estimated α_(p)(.), say α_(p)′(.);     -   Process 3: calculate (backwardly) β_(K−1)(.), . . . , β_(q+1)(.)         starting from β_(K)(.); and     -   Process 4: calculate (backwardly) β_(q)(.), . . . , β₁(.)         starting from an estimated β_(q+1)(.), say β_(q+1)′(.).

Process 1 and 3 are run as regular turbo alpha and beta calculation with known initial points (with reduced size), process 2 and 4 require estimated initial points.

β_(q+1)′(.) for process 4. The first iteration starts from α_(p−d+1)(.) where d is an arbitrary amount of time steps. The state at time p−d+1 is treated as a uniform random variable. This implies that the probability of a specific state occurs at p−d+1 is ⅛ since the 3GPP turbo encoder has 8 system states. As a consequence, α_(p−d+1)(.)=⅛ and similarly so does β_(q+d)(.). Starting from this uniform prior, when the process reaches at p, the estimate α_(p)′(.) results, and at q+1, the estimate β_(q+1)′(.) results.

The amount of information extracted from the observation for the duration d is proportional to d. A longer d may give a better initial estimate. However, since the computation during d steps represents “overhead”, d should not be increased more than a certain limit. While d may be in the range of 1–20, simulation show that d=15˜20 provides decent results. From the second iteration on, α_(p−d+1)(.) and β_(q+d)(.) can be chosen by the same way as for the first iteration, or the values resulted from process 1 and process 3 in previous iteration can be used.

Simulation scenarios are defined by SNR (signal to noise ratio). For each scenario, 2000 packets of size 5114 bits were randomly generated, turbo encoded, and subjected to AWGN noise. The “spoiled” packets were run through both the regular prior art and present parallel turbo decoders. For the parallel turbo decoders of the present invention, the number of divisions M=2 and the length for initial estimation d=20 in the parallel algorithm, and the appropriate values of the previous iterations as the starting points of the initial estimation of the current iteration were used.

FIG. 3 and FIG. 4 compare the BER (bit error rate) and BLER (block error rate, or packet error rate) of the regular turbo decoder and parallel turbo decoder under various SNR. The results were so close they are not dissemble on the graphs.

Although the number of segments M=2 has been used as an example, a larger number for M may be used. In such case, the equations would have the general formula as follows: L(u_(k))=f(α_(k)(.), β_(k)(.)). The definitions of the estimated starting points would be α_(p)(.), . . . , α_(w)(.) and β_(w)(.), . . . , β_(q+1)(.). The forward variable segments are calculated as follows:

$\quad\begin{matrix} {{\alpha_{1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{p}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{0}\left( . \right)}}} \\ {{\alpha_{p + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{q}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{p}\left( . \right)}}} \\ {\mspace{40mu}\vdots} \\ {{\alpha_{w + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{K}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{w}\left( . \right)}}} \end{matrix}$ and the reverse variable segments are calculated as follows:

$\quad\begin{matrix} {{\beta_{K - 1}\left( . \right)},\ldots\mspace{11mu},{{\beta_{w + 1}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\beta_{K}\left( . \right)}}} \\ {{\beta_{w}\left( . \right)},\ldots\mspace{11mu},{{\beta_{v + 1}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\beta_{w + 1}\left( . \right)}}} \\ {\mspace{40mu}\vdots} \\ {{\beta_{q}\left( . \right)},\ldots\mspace{11mu},{{\beta_{1}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{{\beta_{q + 1}\left( . \right)}.}}} \end{matrix}$ The starting points for the forward variable are estimated from:

$\quad\begin{matrix} {{\alpha_{p - d + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{p}\left( . \right)}\mspace{14mu}{and}}} \\ {\mspace{40mu}\vdots} \\ {{{\alpha_{w - d + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{w}\left( . \right)};\;{and}}}\mspace{11mu}} \end{matrix}$ for the backward segments from:

β_(w+d)(.), . . . , β_(w+1)(.) and

β_(q+d)(.), . . . , β_(q+1)(.)

where d is an arbitrary amount of time steps.

It should also be noted that even though turbo decoders are discussed, any system that uses the A Posteriori Probability decoding may use the present invention.

Although the present invention has been described and illustrated in detail, it is to be clearly understood that this is done by way of illustration and example only and is not to be taken by way of limitation. The spirit and scope of the present invention are to be limited only by the terms of the appended claims. 

1. A method of a turbo decoder using log A Posteriori Probability L(u_(k)), where L(u_(k))=f(α_(k)(.), β_(k)(.)), the method comprising: dividing a forward variable α (.) and a backward variable β (.) into a plurality M of parallel segments of size p, q . . . w, where p+q, . . . +w equals the length of a coded word U; simultaneous, parallel calculating the segments of forward variable α (.) of the code word U as follows: $\quad\begin{matrix} {{\alpha_{1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{p}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{0}\left( . \right)}}} \\ {{\alpha_{p + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{q}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{p}\left( . \right)}}} \\ {\mspace{40mu}\vdots} \\ {{\alpha_{w + 1}\left( . \right)},\ldots\mspace{11mu},{{{\alpha_{K}\left( . \right)}\mspace{14mu}{starting}\mspace{14mu}{from}\mspace{14mu}{\alpha_{w}\left( . \right)}};}} \end{matrix}$  and the segments of the backward variable β (.) of the code word U as follows: β_(K − 1)(.), …  , β_(w + 1)(.)  starting  from  β_(K)(.) β_(w)(.), …  , β_(v + 1)(.)  starting   from  β_(w + 1)(.) ⋮ β_(q)(.), …  , β₁(.)  starting   from  β_(q + 1)(.);  and calculating L(u_(k)) using the parallel calculated segments of α (.) and β (.).
 2. The method according to claim 1, wherein the segment sizes are set equal.
 3. A signal receiver including a decoder performing the method according to claim
 1. 4. The method according to claim 1, wherein the starting points α_(p)(.), . . . , α_(w)(.) are estimated, and the starting points β_(w+1)(.), . . . , β_(q+1) are estimated.
 5. The method according to claim 4, wherein the starting points for the forward variable are estimated from: $\quad\begin{matrix} {{\alpha_{p - d + 1}\left( . \right)},\ldots\mspace{11mu},{\alpha_{p}\left( . \right)}} \\ {\mspace{40mu}\vdots} \\ {{\alpha_{w - d + 1}\left( . \right)},\ldots\mspace{11mu},{{\alpha_{w}\left( . \right)};}} \end{matrix}$ and for the backward segments from: β_(w + d)(.), …  , β_(w + 1)(.) ⋮ β_(q + d)(.), …  , β_(q + 1)(.) where d is an arbitrary amount of time steps.
 6. The method according to claim 5, wherein d is in the range of 1 to
 20. 7. The method according to claim 5, wherein d is in the range of 15 to
 20. 8. The method according to claim 5, wherein the probabilities of the first states for estimating the starting points are uniform random variables.
 9. The method according to claim 5, wherein the first states for estimating the starting points are a predetermined state.
 10. The method according to claim 5, wherein the first states for estimating the starting point is one divided by the number of possible states.
 11. A method of decoding using a log A Posteriori Probability ratio L(u_(k)) where L(u_(k))=f(α_(k)(.), β_(k)(.) ), the method comprising: dividing a forward variable α (.) and a backward variable β (.) into two segments p and q where p+q equals the length of the code word U; parallel calculating the forward segments: α₁(.), . . . ,α_(p)(.) starting from a known α₀(.) and α_(p+1)(.), . . . ,α_(k)(.) starting from an estimated α_(p)(.); parallel calculating the backward segments: β_(K−1)(.), . . . , β_(q+1)(.) starting from a known β_(K)(.) and β_(q)(.), . . . , β₁(.) starting from an estimated β_(q+1)(.); and calculating L(u_(k)) using the parallel calculated segments of α (.) and β (.). wherein the forward and backward segments are calculated simultaneously.
 12. A signal receiver including a decoder performing the method according to claim
 11. 13. A method according to claim 11, wherein the estimated starting point α_(p)(.) is estimated from state probabilities α_(p−d+1)(.), . . . , α_(p)(.), and the estimated starting point β_(q+1)(.) is estimated from state probabilities for β_(q+d)(.), . . . , β_(q+1)(.).
 14. A method according to claim 13, wherein d is in the range of 1 to
 20. 15. A method according to claim 13, wherein d is in the range of 15 to
 20. 16. A method according to claim 13, wherein the probabilities of the first states for estimating the starting points are uniform random variables.
 17. A method according to claim 13, wherein the first states for estimating the starting points are a predetermined state.
 18. A method according to claim 13, wherein the first states for estimating the starting point is one divided by the number of possible states. 